Spatial-spectral cube matching frame for spectral CT reconstruction
نویسندگان
چکیده
منابع مشابه
Hybrid spectral CT reconstruction
Current photon counting x-ray detector (PCD) technology faces limitations associated with spectral fidelity and photon starvation. One strategy for addressing these limitations is to supplement PCD data with high-resolution, low-noise data acquired with an energy-integrating detector (EID). In this work, we propose an iterative, hybrid reconstruction technique which combines the spectral proper...
متن کاملReconstruction of spectral CT images
X-ray computed tomography (CT) is a medical imaging modality that allows reconstruction of the internal stucture of the human body from a large number of x-ray attenuation measurements. In recent years, the development of spectral CT, in which the energy dependence of the x-ray attenuation coe cient is utilized, has attracted considerable interest. This thesis is concerned with a spectral CT sy...
متن کاملNonparametric Spectral-Spatial Anomaly Detection
Due to abundant spectral information contained in the hyperspectral images, they are suitable data for anomalous targets detection. The use of spatial features in addition to spectral ones can improve the anomaly detection performance. An anomaly detector, called nonparametric spectral-spatial detector (NSSD), is proposed in this work which utilizes the benefits of spatial features and local st...
متن کاملB-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maximum weight matching and is solvable in polynomial time. Instead of a permutation matrix, it produces a binary matrix with rows and columns summing to a positive integer b. The b-matching procedure prunes graph edges s...
متن کاملSpectral Descriptors for Graph Matching
In this paper, we consider the weighted graph matching problem. Recently, approaches to this problem based on spectral methods have gained significant attention. We propose two graph spectral descriptors based on the graph Laplacian, namely a Laplacian family signature (LFS) on nodes, and a pairwise heat kernel distance on edges. We show the stability of both our descriptors under small perturb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inverse Problems
سال: 2018
ISSN: 0266-5611,1361-6420
DOI: 10.1088/1361-6420/aad67b